Approximating the min–max (regret) selecting items problem
نویسندگان
چکیده
منابع مشابه
The Minmax Regret Shortest Path Problem with Interval Arc Lengths
This paper considers the shortest path problem on directed acyclic graphs, where the uncertainty of input data (lengths of arcs) is modeled in the form of intervals. In order to handle the interval data the minmax criterion to the regret values is applied, where the original objective function with interval coefficients is transformed into that of finding the least maximum worst-case regret, wh...
متن کاملEvolutionary Algorithm for Minmax Regret Flow-shop Problem
Received: 1 June 2015 Abstract Accepted: 30 July 2015 The uncertain flow-shop is considered. It is assumed that processing times are not given a priori, but they belong to intervals of known bounds. The absolute regret (regret) is used to evaluate a solution (a schedule) which gives the minmax regret binary optimization problem. The evolutionary heuristic solution algorithm is experimentally co...
متن کاملImproved Approximation Algorithms for the Min-Max Selecting Items Problem
We give a simple deterministic O(logK/ log logK) approximation algorithm for the Min-Max Selecting Items problem, where K is the number of scenarios. While our main goal is simplicity, this result also improves over the previous best approximation ratio of O(logK) due to Kasperski, Kurpisz, and Zieliński (Information Processing Letters (2013)). Despite using the method of pessimistic estimators...
متن کاملHeuristic algorithms for the minmax regret flow-shop problem with interval processing times
An uncertain version of the permutation flow-shop with unlimited buffers and the makespan as a criterion is considered. The investigated parametric uncertainty is represented by given interval-valued processing times. The maximum regret is used for the evaluation of uncertainty. Consequently, the minmax regret discrete optimization problem is solved. Due to its high complexity, two relaxations ...
متن کاملA tabu search algorithm for the minmax regret minimum spanning tree problem with interval data
This paper deals with the strongly NP-hard minmax regret version of the minimum spanning tree problem with interval costs. The best known exact algorithms solve the problem in reasonable time for rather small graphs. In this paper an algorithm based on the idea of tabu search is constructed. Some properties of the local minima are shown. Exhaustive computational tests for various classes of gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2013
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2012.10.001